/*
 * @lc app=leetcode.cn id=2269 lang=typescript
 *
 * [2269] 找到一个数字的 K 美丽值
 */

// @lc code=start
function divisorSubstrings(num: number, k: number): number {
    let numS = num.toString();
    let count = 0;
    for (let i = k; i < numS.length + 1; i++) {
        const int = parseInt(numS.slice(i - k, i));
        if (num % int === 0) count++;
    }
    return count;
}
// @lc code=end
